Undecidable Varieties with Solvable
نویسندگان
چکیده
The purpose of this paper is to present some new, simpler examples of recursively based undecidable varieties of finite type having solvable word problems.
منابع مشابه
FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems
Exploiting a new technique for proving undecidability results developed by A. Sattler-Klein in her doctoral dissertation (1996) it is shown that it is undecidable in general whether or not a nitely presented monoid with a solvable word problem has nite derivation type (FDT). This improves upon the undecidability result of R. Cremanns and F. Otto (1996), which was based on the undecidability of ...
متن کاملOn the theories of free solvable groups’
We prove that the terms of the derived series of a free solvable group are definable by existential formulae. We use this result to prove some ‘model theoretic’ results about free solvable groups. For example, we prove that if Hilbert’s 10th problem has a negative answer for the field of the rationals, then the universal theory of a noncyclic free solvable group of class > 3 is undecidable. @ 1...
متن کاملHILBERT’S TENTH PROBLEM FOR FUNCTION FIELDS OF VARIETIES OVER NUMBER FIELDS AND p-ADIC FIELDS
Let k be a subfield of a p-adic field of odd residue characteristic, and let L be the function field of a variety of dimension n ≥ 1 over k. Then Hilbert’s Tenth Problem for L is undecidable. In particular, Hilbert’s Tenth Problem for function fields of varieties over number fields of dimension ≥ 1 is undecidable.
متن کاملSolvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General
A nite special and connuent string-rewriting system S is constructed such that it is undecidable in general whether a word equation is solvable mod S. Thus, (word) uniication mod S is undecidable.
متن کاملA Finitely Axiomatizable Undecidable Equational Theory with Recursively Solvable Word Problems
In this paper we construct a finitely based variety, whose equational theory is undecidable, yet whose word problems are recursively solvable, which solves a problem stated by G. McNulty (1992). The construction produces a discriminator variety with the aforementioned properties starting from a class of structures in some multisorted language (which may include relations), axiomatized by a fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003